A concept of sincerity for combinatorial voting

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sincerity in Simple and Complex Voting Mechanisms

We discuss sincere voting when voters have cardinal preferences over alternatives. We interpret sincerity as opposed to strategic voting, and thus de…ne sincerity as the optimal behavior when conditions to vote strategically diminish. When voting mechanisms allow for only one message type (simple voting mechanisms) we show that eliminating some conditions for strategic voting, individuals’ opti...

متن کامل

Combinatorial Voting

We study elections that simultaneously decide multiple issues, where voters have independent private values over bundles of issues. The innovation is considering nonseparable preferences, where issues may be complements or substitutes. Voters face a political exposure problem: the optimal vote for a particular issue will depend on the resolution of the other issues. Moreover, the probabilities ...

متن کامل

Does uncertainty lead to sincerity? Simple and complex voting mechanisms

We ask whether the absence of information about other voters’ preferences allows optimal voting to be interpreted as sincere. We start by classifying voting mechanisms as simple and complex according to the number of message types voters can use to elect alternatives. We show that while the elimination of information about other voters’ preferences allows optimal voting to be interpreted as sin...

متن کامل

Voting in Combinatorial Domains

This chapter addresses preference aggregation and voting on domains which are the Cartesian product (or sometimes, a subset of the Cartesian product) of finite domain values, each corresponding to an issue, a variable, or an attribute. As seen in other chapters of this handbook, voting rules map a profile (usually, a collection of rankings, see Chapter 1 (Zwicker, 2015)) into an alternative or ...

متن کامل

Voting Theory for Concept Detection

This paper explores the issue of detecting concepts for ontology learning from text. We investigate various metrics from graph theory and propose various voting schemes based on these metrics. The idea draws its root in social choice theory, and our objective is to mimic consensus in automatic learning methods and increase the confidence in concept extraction through the identification of the b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Choice and Welfare

سال: 2018

ISSN: 0176-1714,1432-217X

DOI: 10.1007/s00355-018-1125-5